Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
نویسندگان
چکیده
The braid group with its conjugacy problem is one of the recent hot issues in cryptography. At CT-RSA 2001, Anshel, Anshel, Fisher, and Goldfeld proposed a commutator key agreement protocol (KAP) based on the braid groups and their colored Burau representation. Its security is based on the multiple simultaneous conjugacy problem (MSCP) plus a newly adopted key extractor. This article shows how to reduce finding the shared key of this KAP to the list-MSCPs in a permutation group and in a matrix group over a finite field. We also develop a mathematical algorithm for the MSCP in braid groups. The former implies that the usage of colored Burau representation in the key extractor causes a new weakness, and the latter can be used as a tool to investigate the security level of their KAP.
منابع مشابه
An Authenticated Group Key Agreement Protocol on Braid groups
In this paper, we extend the 2-party key exchange protocol on braid groups to the group key agreement protocol based on the hardness of Ko-Lee problem. We also provide authenticity to the group key agreement protocol.
متن کاملLength-based conjugacy search in the Braid group
Anshel, et. al., introduced a new cryptographic protocol, the Commutator key agreement protocol, whose strength lies heavily on the difficulty of the generalized conjugacy problem in subgroups of the Braid group. A natural approach to this problem is by using a length-based method, with the length of the Garside normal form as a length function. Experiments show that this approach is far from b...
متن کاملAn Overview of Braid Group Cryptography
The past several years have seen an explosion of interest in the cryptographic applications of non-commutative groups. Braid groups in particular are especially desirable, as they provide difficult computational problems and can be implemented quite efficiently. Several different groups of researchers have proposed numerous cryptographic protocols that make use of braid groups, but unfortunatel...
متن کاملTripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups
Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved tha...
متن کاملA New Key Agreement Scheme Based on the Triple Decomposition Problem
A new key agreement scheme based on the triple decomposition problem over non-commutative platforms is presented. A realization of the new scheme over braid groups is provided and the strengths of it over earlier systems that rely on similar decomposition problems are discussed. The new scheme improves over the earlier systems over braid groups by countering the linear algebra and length based ...
متن کامل